High-Throughput Crowdsourcing Mechanisms for Complex Tasks
Identifieur interne : 000470 ( Main/Exploration ); précédent : 000469; suivant : 000471High-Throughput Crowdsourcing Mechanisms for Complex Tasks
Auteurs : Guido Sautter [Allemagne, États-Unis] ; Klemens Böhm [Allemagne, États-Unis]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2011.
Abstract
Abstract: Crowdsourcing is popular for large-scale data processing endeav ors that require hu man input. However, working with a large community of users raises new chal lenges. In particular, both possible misjudgment and disho nesty threaten the quality of the results. Common countermeasures are based on redundancy, giving way to a tradeoff between result quality and throughput. Ideally, measures should (1) maintain high throughput and (2) ensure high result quality at the same time. Existing work on crowdsourcing mostly focuses on result quality, paying little attention to throughput or even to that tradeoff. One reason is that the number of tasks (individual atomic units of work) is usually small. A further problem is that the tasks users work on are small as well. In consequence, existing result-improvement mecha nisms do not scale to the number or complexity of tasks that arise, for instance, in proofreading and processing of digitized legacy literature. This paper proposes novel result-improvement mechanisms that (1) are independent of the size and complexity of tasks and (2) allow to trade result quality for throughput to a significant extent. Both mathematical analyses and extensive simulations show the effectiveness of the proposed mechanisms.
Url:
DOI: 10.1007/978-3-642-24704-0_27
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000717
- to stream Istex, to step Curation: 000709
- to stream Istex, to step Checkpoint: 000127
- to stream Main, to step Merge: 000476
- to stream Main, to step Curation: 000470
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">High-Throughput Crowdsourcing Mechanisms for Complex Tasks</title><author><name sortKey="Sautter, Guido" sort="Sautter, Guido" uniqKey="Sautter G" first="Guido" last="Sautter">Guido Sautter</name></author><author><name sortKey="Bohm, Klemens" sort="Bohm, Klemens" uniqKey="Bohm K" first="Klemens" last="Böhm">Klemens Böhm</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:FC6F42FA0D11E6D46845370FE7BAC983B2C800F2</idno><date when="2011" year="2011">2011</date><idno type="doi">10.1007/978-3-642-24704-0_27</idno><idno type="url">https://api.istex.fr/document/FC6F42FA0D11E6D46845370FE7BAC983B2C800F2/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000717</idno><idno type="wicri:Area/Istex/Curation">000709</idno><idno type="wicri:Area/Istex/Checkpoint">000127</idno><idno type="wicri:doubleKey">0302-9743:2011:Sautter G:high:throughput:crowdsourcing</idno><idno type="wicri:Area/Main/Merge">000476</idno><idno type="wicri:Area/Main/Curation">000470</idno><idno type="wicri:Area/Main/Exploration">000470</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">High-Throughput Crowdsourcing Mechanisms for Complex Tasks</title><author><name sortKey="Sautter, Guido" sort="Sautter, Guido" uniqKey="Sautter G" first="Guido" last="Sautter">Guido Sautter</name><affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country><wicri:regionArea>KIT, Am Fasanengarten 5, 76128, Karlsruhe</wicri:regionArea><placeName><region type="land" nuts="1">Bade-Wurtemberg</region><region type="district" nuts="2">District de Karlsruhe</region><settlement type="city">Karlsruhe</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">États-Unis</country></affiliation></author><author><name sortKey="Bohm, Klemens" sort="Bohm, Klemens" uniqKey="Bohm K" first="Klemens" last="Böhm">Klemens Böhm</name><affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country><wicri:regionArea>KIT, Am Fasanengarten 5, 76128, Karlsruhe</wicri:regionArea><placeName><region type="land" nuts="1">Bade-Wurtemberg</region><region type="district" nuts="2">District de Karlsruhe</region><settlement type="city">Karlsruhe</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">États-Unis</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2011</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">FC6F42FA0D11E6D46845370FE7BAC983B2C800F2</idno><idno type="DOI">10.1007/978-3-642-24704-0_27</idno><idno type="ChapterID">27</idno><idno type="ChapterID">Chap27</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Crowdsourcing is popular for large-scale data processing endeav ors that require hu man input. However, working with a large community of users raises new chal lenges. In particular, both possible misjudgment and disho nesty threaten the quality of the results. Common countermeasures are based on redundancy, giving way to a tradeoff between result quality and throughput. Ideally, measures should (1) maintain high throughput and (2) ensure high result quality at the same time. Existing work on crowdsourcing mostly focuses on result quality, paying little attention to throughput or even to that tradeoff. One reason is that the number of tasks (individual atomic units of work) is usually small. A further problem is that the tasks users work on are small as well. In consequence, existing result-improvement mecha nisms do not scale to the number or complexity of tasks that arise, for instance, in proofreading and processing of digitized legacy literature. This paper proposes novel result-improvement mechanisms that (1) are independent of the size and complexity of tasks and (2) allow to trade result quality for throughput to a significant extent. Both mathematical analyses and extensive simulations show the effectiveness of the proposed mechanisms.</div></front></TEI><affiliations><list><country><li>Allemagne</li><li>États-Unis</li></country><region><li>Bade-Wurtemberg</li><li>District de Karlsruhe</li></region><settlement><li>Karlsruhe</li></settlement></list><tree><country name="Allemagne"><region name="Bade-Wurtemberg"><name sortKey="Sautter, Guido" sort="Sautter, Guido" uniqKey="Sautter G" first="Guido" last="Sautter">Guido Sautter</name></region><name sortKey="Bohm, Klemens" sort="Bohm, Klemens" uniqKey="Bohm K" first="Klemens" last="Böhm">Klemens Böhm</name></country><country name="États-Unis"><noRegion><name sortKey="Sautter, Guido" sort="Sautter, Guido" uniqKey="Sautter G" first="Guido" last="Sautter">Guido Sautter</name></noRegion><name sortKey="Bohm, Klemens" sort="Bohm, Klemens" uniqKey="Bohm K" first="Klemens" last="Böhm">Klemens Böhm</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000470 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000470 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= OcrV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:FC6F42FA0D11E6D46845370FE7BAC983B2C800F2
|texte= High-Throughput Crowdsourcing Mechanisms for Complex Tasks
}}
| This area was generated with Dilib version V0.6.32. |  |